Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions
نویسندگان
چکیده
The No Free Lunch (NFL) theorem due to Wolpert and Macready (1997) has led to controversial discussions on the usefulness of randomized search heuristics, in particular, evolutionary algorithms. Here a short and simple proof of the NFL theorem is given to show its elementary character. Moreover, the proof method leads to a generalization of the NFL theorem. Afterwards, realistic complexity theoretical based scenarios for black box optimization are presented and it is argued why NFL theorems are not possible in such situations. However, an Almost No Free Lunch (ANFL) theorem shows that for each function which can be optimized efficiently by a search heuristic there can be constructed many related functions where the same heuristic is bad. As a consequence, search heuristics use some idea how to look for good points and can be successful only for functions “giving the right hints”. The consequences of these theoretical considerations for some well-known classes of functions are discussed.
منابع مشابه
Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Optimization with Randomized Search Heuristics: The (A)NFL Theorem, Realistic Scenarios, and Difficult Functions
The No Free Lunch (NFL) theorem due to Wolpert and Macready (1997) has led to controversial discussions on the usefulness of randomized search heuristics, in particular, evolutionary algorithms. Here a short and simple proof of the NFL theorem is given to show its elementary character. Moreover, the proof method leads to a generalization of the NFL theorem. Afterwards, realistic complexity theo...
متن کاملOptimization with randomized search heuristics—the (A)NFL theorem, realistic scenarios, and di)cult functions
The No Free Lunch (NFL) theorem due to Wolpert and Macready (IEEE Trans. Evol. Comput. 1(1) (1997) 67) has led to controversial discussions on the usefulness of randomized search heuristics, in particular, evolutionary algorithms. Here a short and simple proof of the NFL theorem is given to show its elementary character. Moreover, the proof method leads to a generalization of the NFL theorem. A...
متن کاملTitle Generalization of the no - free - lunch theorem
The No-Free-Lunch (NFL) Theorem provides a fundamental limit governing all optimization/search algorithms and has successfully drawn attention to theoretical foundation of optimization and search. However, we find several limitations in the original NFL paper. In this work, using results from the nature of search algorithms, we enhance several aspects of the original NFL Theorem. We have identi...
متن کاملA No-Free-Lunch theorem for non-uniform distributions of target functions
The sharpened No-Free-Lunch-theorem (NFL-theorem) states that, regardless of the performance measure, the performance of all optimization algorithms averaged uniformly over any finite set F of functions is equal if and only if F is closed under permutation (c.u.p.). In this paper, we first summarize some consequences of this theorem, which have been proven recently: The number of subsets c.u.p....
متن کاملFree Noodle Soup
In this note I want to point out a relation between the No-Free-Lunch (NFL) Theorem and some simple models of biological evolution. This point is mathematically trivial, but I believe it nevertheless is of some interest. The NFL theorem characterizes the relative average performance of search algorithms and without being an expert in the field, I believe that its main impact has been to make re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 287 شماره
صفحات -
تاریخ انتشار 2002